Origami Pop-up Card Generation from 3D Models Using a Directed Acyclic Graph

نویسندگان

  • Der-Lor Way
  • Yi-Shan Tsai
  • Zen-Chung Shih
چکیده

Origami is a paper art used to create three-dimensional (3D) objects by cutting and folding a single sheet of paper. Origami is labor-intensive and requires a high skill level to generate two-dimensional (2D) objects that pop-up into realistic 3D objects. However, this special feature makes designing an origami architecture procedure challenging. This paper provides a novel algorithm to create an origami paper card from a 3D model with a user-specified folding line. The algorithm segments the 2D shape from a 3D model and creates layers of the pop-up paper card using a directed acyclic graph. After applying layers to the layout, the algorithm creates connections between layers, and then outputs the origami layout. Based on a directed acyclic graph, the algorithm computes a class of paper architectures containing two sets of layers and connections that approximate the input geometry while guaranteeing that a pop up card is physically realizable. The proposed method is demonstrated with a number of paper pop-ups, and physical experimental results are presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-style paper pop-up designs from 3D models

Paper pop-ups are interesting three-dimensional books that fascinate people of all ages. The design and construction of these pop-up books however are done manually and require a lot of time and effort. This has led to computer-assisted or automated tools for designing paper pop-ups. This paper proposes an approach for automatically converting a 3D model into a multi-style paper pop-up. Previou...

متن کامل

Learning Acyclic Directed Mixed Graphs from Observations and Interventions

We introduce a new family of mixed graphical models that consists of graphs with possibly directed, undirected and bidirected edges but without directed cycles. Moreover, there can be up to three edges between any pair of nodes. The new family includes Richardson’s acyclic directed mixed graphs, as well as Andersson-Madigan-Perlman chain graphs. These features imply that no family of mixed grap...

متن کامل

A Hybrid Anytime Algorithm for the Construction of Causal Models From Sparse Data

We present a hybrid constraintbased/Bayesian algorithm for learning causal networks in the presence of sparse data. The algorithm searches the space of equivalence classes of models (essential graphs) using a heuristic based on conventional constraintbased techniques. Each essential graph is then converted into a directed acyclic graph and scored using a Bayesian scoring metric. Two variants of...

متن کامل

A Hybrid Anytime Algorithm for the Constructiion of Causal Models From Sparse Data

We present a hybrid constraint­ based/Bayesian algorithm for learning causal networks in the presence of sparse data. The algorithm searches the space of equivalence classes of models (essential graphs) using a heuristic based on conventional constraint­ based techniques. Each essential graph is then converted into a directed acyclic graph and scored using a Bayesian scoring met­ ric. Two varia...

متن کامل

A Two Phase Verification Algorithm for Cyclic Workflow Graphs

The widespread automation of e-business processes has made workflow analysis and design an integral part of information management. Graph-based workflow models enables depicting complex processes in a fairly compact form. This free form, on the other hand, can yield models that may fail depending on the judgment of the modeler and create modeling situations that cannot be executed or will behav...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Inf. Sci. Eng.

دوره 29  شماره 

صفحات  -

تاریخ انتشار 2013